Tree Flow: Displaying Structural Changes to Hierarchies
نویسنده
چکیده
We describe Tree Flow, a new technique for visualizing changes to the structure of a hierarchy, and discuss a prototype tool that implements this method. Roughly speaking, Tree Flow works by creating a timeline in which the x-axis corresponds to date information, and the y-axis corresponds to the depth-first ordering of data in a time-varying tree structure. We present several examples of real-world data presented in this format and describe how the visualizations reveal important features of the data. CR
منابع مشابه
Visualizing MeSH Dataset using Radial Tree Layout
Many display layout techniques were developed for the visualization of hierarchical data set like Cone tree, Treemap, Hyperbolic tree etc. Here, we present a new focus + context (fisheye) technique for visualizing and manipulating large hierarchies. We use the well knows radial tree layout method, in which focused node is placed in center of display, and all other nodes are rendered on appropri...
متن کاملA Tool for Manipulating Expressive and Structural Hierarchies in Music
The T-R Trees software system is a set of software tools for the graphical and programmatic manipulation of expressive and structural hierarchies in music composition. It is loosely based on the hierarchies described in Fred Lerdahl and Ray Jackendoof’s landmark book A Generative Theory of Tonal Music—weighted grouping and prolongational reduction trees (also called tension-relaxation or T-R tr...
متن کاملCandidTree: Visualizing Structural Uncertainty in Similar Hierarchies
Most visualization systems fail to convey uncertainty within data. To provide a way to show uncertainty in similar hierarchies, we interpreted the differences between two tree structures as uncertainty. We developed a new interactive visualization system called CandidTree that merges two trees into one and visualizes two types of structural uncertainty: location and sub-tree structure uncertain...
متن کاملOn the topological complexity of tree languages
The article surveys recent results in the study of topological complexity of recognizable tree languages. Emphasis is put on the relation between topological hierarchies, like the Borel hierarchy or the Wadge hierarchy, and the hierarchies resulting from the structure of automata, as the Rabin-Mostowski index hierarchy. The topological complexity of recognizable tree languages is seen as an evi...
متن کاملUnderstanding the behaviour of distributed applications through reverse engineering
Understanding the behaviour of distributed applications is a very challenging task, due to their complexity. The top-down use of suitable abstraction hierarchies is frequently proposed to manage this complexity. Given the size of distributed applications, manually deriving such abstraction hierarchies seems unrealistic. This paper discusses tools that automate the derivation of suitable abstrac...
متن کامل